The Bisimulation Problem for Equational Graphs of Finite Out-Degree
نویسنده
چکیده
The bisimulation problem for equational graphs of finite out-degree is shown to be decidable. We reduce this problem to the η-bisimulation problem for deterministic rational (vectors of) boolean series on the alphabet of a dpda M. We then exhibit a complete formal system for deducing equivalent pairs of such vectors.
منابع مشابه
Bisimulation equivalence of first-order grammars is Ackermann-hard
Bisimulation equivalence (or bisimilarity) of first-order grammars is decidable, as follows from the decidability result by Sénizergues (1998, 2005) that has been given in an equivalent framework of equational graphs with finite out-degree, or of pushdown automata (PDA) with only deterministic and popping ε-transitions. Benedikt, Göller, Kiefer, and Murawski (2013) have shown that the bisimilar...
متن کاملBisimulation of Context-free Grammars and of Pushdown Automata
We consider the bisimulation on the transition graphs of pushdown automata. First we give a characterization of bisimulation using the unfolded trees. We recall that the bisimulation is decidable for the subclass of preex transition graphs of context-free grammars. Furthermore any pushdown transition graph is a regular graph: it can be generated by iterated parallel rewritings of a deterministi...
متن کاملEquational Axioms for Probabilistic Bisimilarity
This paper gives an equational axiomatization of probabilistic bisimulation equivalence for a class of finite-state agents previously studied by Stark and Smolka ((2000) Proof, Language, and Interaction: Essays in Honour of Robin Milner, pp. 571–595). The axiomatization is obtained by extending the general axioms of iteration theories (or iteration algebras), which characterize the equational p...
متن کاملEquational Term Graph Rewriting
We present an equational framework for term graph rewriting with cycles. The usual notion of homomorphism is phrased in terms of the notion of bisimulation, which is well-known in process algebra and concurrency theory. Speciically, a homomorphism is a functional bisimulation. We prove that the bisimilarity class of a term graph, partially ordered by functional bisimulation, is a complete latti...
متن کاملImpossibility Results in the Equational Logic of Processes
This talk offers a survey of negative results on the existence of finite equational axiomatizations for bisimulation equivalence over fragments of algebraic process calculi.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 34 شماره
صفحات -
تاریخ انتشار 2005